Relational Semantics for the Turing Schmerl Calculus
نویسندگان
چکیده
In this paper we present relational semantics for the system CC by considering a small variation on Ignatiev’s frame. This is a draft version and shortly a more complete version will be published.
منابع مشابه
A denotational semantics for the symmetric interaction combinators
The symmetric interaction combinators are a variant of Lafont’s interaction combinators. They enjoy a weaker universality property with respect to interaction nets, but are equally expressive. They are a model of deterministic distributed computation, sharing the good properties of Turing machines (elementary reductions) and of the λ-calculus (higher-order functions, parallel execution). We int...
متن کاملA relational model of a parallel and non-deterministic λ-calculus
We recently introduced an extensional model of the pure λ-calculus living in a canonical cartesian closed category of sets and relations [6]. In the present paper, we study the non-deterministic features of this model. Unlike most traditional approaches, our way of interpreting non-determinism does not require any additional powerdomain construction: we show that our model provides a straightfo...
متن کاملA relational semantics for parallelism and non-determinism in a functional setting
We recently introduced an extensional model of the pure λ-calculus living in a canonical cartesian closed category of sets and relations [6]. In the present paper, we study the non-deterministic features of this model. Unlike most traditional approaches, our way of interpreting non-determinism does not require any additional powerdomain construction. We show that our model provides a straightfo...
متن کاملAngelic processes
In the formal modelling of systems, demonic and angelic nondeterminism play fundamental roles as abstraction mechanisms. The angelic nature of a choice pertains to the property of avoiding failure whenever possible. As a concept, angelic choice first appeared in automata theory and Turing machines, where it can be implemented via backtracking. It has traditionally been studied in the refinement...
متن کاملRelational Semantics for Databases and Predicate Calculus
The relational data model requires a theory of relations in which tuples are not only many-sorted, but can also have indexes that are not necessarily numerical. In this paper we develop such a theory and define operations on relations that are adequate for database use. The operations are similar to those of Codd’s relational algebra, but differ in being based on a mathematically adequate theor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017